High-error approximate dictionary search using estimate hash comparisons

High-error approximate dictionary search using estimate hash comparisons

A method for finding all matches in a pre-processed dictionary for a query string q and with at most k differences is presented. A very fast constant-time estimate using hashes is presented. A tree structure is used to minimise the number of estimates made. Practical tests are performed, showing that the estimate can filter out 99% of the full comparisons for 40% error rates and dictionaries of...

Approximate Nearest Neighbor Search through Comparisons

This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects. In contrast with most existing approaches, we can only access the “hidden” space in which the objects live through a similarity oracle. The oracle, given two reference objects and a query object, returns the reference object closest to the query ob...

Approximate search of short patterns with high error rates using the 01⁎0 lossless seeds

Article history: Available online 14 March 2016

Error Estimate for Approximate Solutions Ofa Nonlinear Convection - Diffusion

A High Capacity Email Steganography Scheme using Dictionary

The main objective of steganography is to conceal a secret message within a cover-media in such a way that only the original receiver can discern the presence of the hidden message. The cover-media can be a text, email, audio, image, and video, which can be transmitted through a public channel, such as the Internet. By extending the use of email among Internet users, the provision of email steg...